A HIGHER ORDER ITERATIVE ALGORITHM FOR MULTIVARIATE OPTIMIZATION PROBLEM
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولFuzzy Particle Swarm Optimization Algorithm for a Supplier Clustering Problem
This paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. During recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions is usually complex and unstructured. In general, many quantitative and qualitative factors, such as quality, price, and fl...
متن کاملBLOW-UP AND NONGLOBAL SOLUTION FOR A FAMILY OF NONLINEAR HIGHER-ORDER EVOLUTION PROBLEM
In this paper we consider a kind of higher-order evolution equation as^{kt^{k} + ^{k&minus1}u/t^{k&minus1} +• • •+ut &minus{delta}u= f (u, {delta}u,x). For this equation, we investigate nonglobal solution, blow-up in finite time and instantaneous blow-up under some assumption on k, f and initial data. In this paper we employ the Test function method, the eneralized convexity method an...
متن کاملA Higher-Order Iterative Path Ordering
The higher-order recursive path ordering (HORPO) defined by Jouannaud and Rubio provides a method to prove termination of higher-order rewriting. We present an iterative version of HORPO by means of an auxiliary term rewriting system, following an approach originally due to Bergstra and Klop. We study well-foundedness of the iterative definition, discuss its relationship with the original HORPO...
متن کاملAn Iterative Algorithm for a Hierarchical Problem
where S, T are two nonexpansive mappings and Fix T is the set of fixed points of T . Recently, this problem has been studied by many authors see, e.g., 1–15 . The main reason is that this problem is closely associated with some monotone variational inequalities and convex programming problems see 16–19 . Now, we briefly recall some historic results which relate to the problem 1.1 . For solving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of applied mathematics & informatics
سال: 2014
ISSN: 1598-5857
DOI: 10.14317/jami.2014.747